Generalized quantifiers and discontinuous type constructors
نویسنده
چکیده
ion property for the main clause is greater than or equal to the cardinality of the than clause property. The latter is obtained by taking the boolean meet of the property corresponding to the common noun argument of the hypothetical determiner in the than clause and the noun-phrase abstraction property of the than clause. So our example would be paraphraseable as: ‘the number of books bought by John is greater than the number of records sold by Mary’. ‖more-than‖(CN) = {〈X,Y 〉 ∈ E | |X ∩ ‖CN‖| ≥ |Y |} (39) Now let us see how we can capture the syntactic fine-tuning in terms of a type assignment to the head of the construction — the determiner more in the main clause — so that it can reach out discontinuously to the than clause. The essential point is that the result of np binding in the main clause s domain is not a complete sentence, bu a sentence still looking for a than complement. (Compare the type assignment to an ordinary s level determiner: q(np, s, s)/n.) The than clause is headed by the complementizer than which combines with a clause missing a determiner: s↑(q(np, s, s)/n). more ∈ q(np, s, s/sthan)/n than ∈ sthan/(s↑(q(np, s, s)/n)) To make the semantics explicit, we can assign the complementizer than a lexical lambda term which takes the boolean meet of the property corresponding to the common noun argument of the hypothetical determiner and the noun-phrase abstraction property of the than clause. than = λQ((et)(et)t)tλxe.Q(λPetλQet.P (x) ∧Q(x)) (40) Below the reader can find the semantic recipes computed for the main clause and for the than clause. John bought more books 7→ λQet.more(books)(λxe.bought(x)(john))(Q) (41) than Mary sold records 7→ than(λD(et)(et)t.D(records)(λye.sold(y)(mary))) (42) Working out the lexical recipe for than, they combine to the term given below. more(books)(λxe.bought(x)(john))(λy.(records(y) ∧ sold(y)(mary))) (43) 4.2 Focus, gapping Work by Oehrle (1991) and Van der Linden (1991) on the semantic impact of prosodic organisation shows that one can analyse focus assignment in terms of a focus binder
منابع مشابه
Ordered Random Variables from Discontinuous Distributions
In the absolutely continuous case, order statistics, record values and several other models of ordered random variables can be viewed as special cases of generalized order statistics, which enables a unified treatment of their theory. This paper deals with discontinuous generalized order statistics, continuing on the recent work of Tran (2006). Specifically, we show that in general neither re...
متن کاملModal Logics, Description Logics and Arithmetic Reasoning
Forthcoming in the Journal of Aritificial Intelligence We introduce mathematical programming and atomic decomposition as the basic modal (T-Box) inference techniques for a large class of modal and description logics. The class of description logics suitable for the proposed methods is strong on the arithmetical side. In particular there may be complex arithmetical conditions on sets of accessib...
متن کاملInterpretation and Processing Time of Generalized Quantifiers: Why your Mental Space Matters
Classical quantifiers (e.g., “all”, “some” and “none”) have been extensively studied in logic and psychology. In contrast, generalized quantifiers (e.g., “most”) allow for fine-grained statements about quantities. The discrepancy in the underlying mental representation and its interpretation among interpreters can affect language use and reasoning. We investigated the effect of quantifier type,...
متن کاملMonadic L-fuzzy Quantifiers of the Type <1n,1>
The aim of this paper is to introduce monadic L-fuzzy quantifiers of the type 〈1, 1〉 and to investigate some of their semantic properties that are well-known in the generalized quantifier theory. Further, some relations between the semantic properties of generalized quantifiers are also studied for monadic L-fuzzy quantifiers. Finally, a property “to be extensional w.r.t. a given L-permutation ...
متن کاملThe analysis of the generalized square of opposition
In this paper, we continue the development of a formal theory of intermediate quantifiers (linguistic expressions such as “most”, “many”, “few”, “almost all”, etc.). In previous work, we demonstrated that 105 generalized syllogisms are valid in our theory. We turn our attention to another problem which is the analysis of the generalized Aristotelian square of opposition which, besides the class...
متن کاملSystem with Generalized Quantifiers on Dependent Types for Anaphora
We propose a system for the interpretation of anaphoric relationships between unbound pronouns and quantifiers. The main technical contribution of our proposal consists in combining generalized quantifiers with dependent types. Empirically, our system allows a uniform treatment of all types of unbound anaphora, including the notoriously difficult cases such as quantificational subordination, cu...
متن کامل